go/types.graphNode.succ (field)

8 uses

	go/types (current package)
		initorder.go#L183: 	pred, succ nodeSet    // consumers and dependencies of this node (lazily initialized)
		initorder.go#L191: 	return len(n.pred) * len(n.succ)
		initorder.go#L225: 				n.succ.add(d)
		initorder.go#L261: 				for s := range n.succ {
		initorder.go#L264: 						p.succ.add(s)
		initorder.go#L268: 				delete(p.succ, n) // remove edge to n
		initorder.go#L271: 		for s := range n.succ {
		initorder.go#L279: 		n.ndeps = len(n.succ)